A ug 2 00 0 Bounds for Local Density of Sphere Packings and the Kepler Conjecture Jeffrey

نویسنده

  • Jeffrey C. Lagarias
چکیده

This paper formalizes the local density inequality approach to getting upper bounds for sphere packing densities in Rn. This approach was first suggested by L. Fejes-Tóth in 1954 as a method to prove the Kepler conjecture that the densest packing of unit spheres in R has density π √ 18 , which is attained by the “cannonball packing.” Local density inequalities give upper bounds for the sphere packing density formulated as an optimization problem of a nonlinear function over a compact set in a finite dimensional Euclidean space. The approaches of L. Fejes-Tóth, of W.-Y. Hsiang, and of T. C. Hales, to the Kepler conjecture are each based on (different) local density inequalities. Recently T. C. Hales, together with S. P. Ferguson, has presented extensive details carrying out a modified version of the Hales approach to prove the Kepler conjecture. We describe the particular local density inequality underlying the Hales and Ferguson approach to prove Kepler’s conjecture and sketch some features of their proof. AMS Subject Classification (2000): Primary 52C17, Secondary: 11H31

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for Local Density of Sphere Packings and the Kepler Conjecture

This paper formalizes the local density inequality approach to getting upper bounds for sphere packing densities in Rn. This approach was first suggested by L. Fejes-Tóth in 1954 as a method to prove the Kepler conjecture that the densest packing of unit spheres in R has density π √ 18 , which is attained by the “cannonball packing.” Local density inequalities give upper bounds for the sphere p...

متن کامل

A Proof of the Kepler Conjecture ( unabridged ) Thomas C . Hales To the memory

Historical Overview of the Kepler Conjecture This paper is the first in a series of six papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than the face-centered cubic packing. After some preliminary comments about the face-centered cubic and hexagonal close packings, the history of the Kepler problem is...

متن کامل

Sphere packings revisited

In this paper we survey most of the recent and often surprising results on packings of congruent spheres in d-dimensional spaces of constant curvature. The topics discussed are as follows: Hadwiger numbers of convex bodies and kissing numbers of spheres; Touching numbers of convex bodies; Newton numbers of convex bodies; One-sided Hadwiger and kissing numbers; Contact graphs of finite packings ...

متن کامل

Sphere Packings, V

The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if completed, will jointly comprise a proof of the conjecture. We carry out step five of the program, a proof that the local density of a certain combinatorial arrangement, the pentahedral prism, is less than that of the face-centered cubic lattice packing. We prove various relations on the local d...

متن کامل

1 O ct 2 00 1 NEW UPPER BOUNDS ON SPHERE PACKINGS

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008